/*************************************************************************
 * File Name:    Search_in_Rotated_Sorted_Array.cc
 * Author:       zero91
 * Mail:         jianzhang9102@gmail.com
 * Created Time: 2013/11/8 0:54:12
 * 
 * Description:  
 |------------------------------------------------------------------------
 | Problem: Search in Rotated Sorted Array
 |
 | Suppose a sorted array is rotated at some pivot unknown to you beforehand.
 |
 | (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
 |
 | You are given a target value to search. If found in the array return its index,
 | otherwise return -1.
 |
 | You may assume no duplicate exists in the array.
 |------------------------------------------------------------------------
 ************************************************************************/

#include <iostream>
#include <fstream>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>

using namespace std;

class Solution {
public:
    int search(int A[], int n, int target)
    {
        int left, right, mid;
        
        left = 0, right = n - 1;
        while (left <= right) {
            mid = left + (right - left) / 2;
            
            if (A[mid] == target) return mid;
            
            if (A[left] <= A[mid]) {
                if (A[left] <= target && A[mid] > target) right = mid - 1;
                else left = mid + 1;
            } else {
                if (A[right] >= target && A[mid] < target) left = mid + 1;
                else right = mid - 1;
            }
        }
        return -1;
    }
};

